Perfect GO-spaces which have a perfect linearly ordered extension
نویسندگان
چکیده
منابع مشابه
Linearly Ordered Topological Spaces
This work is devoted to the study of certain cardinality modifications of paracompactness and compactness in the setting of linearly ordered spaces. Some of the concepts treated here have previously been studied by Aquaro [l]1, Gulden [4], Kennison [5], Mansfield [6], Morita [7], and Poppe [9]. On the other hand, the concept of m-boundedness, introduced in §2, is new. Our main results (Theorems...
متن کاملWhich weighted circulant networks have perfect state transfer?
The question of perfect state transfer existence in quantum spin networks based on weighted graphs has been recently presented by many authors. We give a simple condition for characterizing weighted circulant graphs allowing perfect state transfer in terms of their eigenvalues. This is done by extending the results about quantum periodicity existence in the networks obtained by Saxena, Severini...
متن کاملDuality and Perfect Probability Spaces
Given probability spaces (Xi,Ai, Pi), i = 1, 2, let M(P1, P2) denote the set of all probabilities on the product space with marginals P1 and P2 and let h be a measurable function on (X1 × X2,A1 ⊗ A2). Continuous versions of linear programming stemming from the works of Monge (1781) and Kantorovich-Rubinštein (1958) for the case of compact metric spaces are concerned with the validity of the dua...
متن کاملFinding Succinct Ordered Minimal Perfect Hash Functions
An ordered minimal perfect hash table is one in which no collisions occur among a prede ned set of keys, no space is unused and the data are placed in the table in order. A new method for creating ordered minimal perfect hash functions is presented. It creates hash functions with representation space requirements closer to the theoretical lower bound than previous methods. The method presented ...
متن کاملPerfect Codes on Some Ordered Sets
Using the concept of codes on ordered sets introduced by Brualdi, Graves and Lawrence, we consider perfect codes on the ordinal sum of two ordered sets, the standard ordered sets and the disjoint sum of two chains. In the classical coding theory all perfect codes are completely described in terms of parameters (cf. [2, 3]). They are mathematically interesting structures. Brualdi et al. [1] rece...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 1997
ISSN: 0166-8641
DOI: 10.1016/s0166-8641(97)00019-9